Algorithms on Strings based on the Compressed Suffix Arrays
نویسنده
چکیده
A4J88!:w$N$?$a$N:w0z$G$"$k@\Hx<-G[Ns$O, B>$NA4J88!:w:w0z$HHf3S$9$k$H>J%9%Z!<%9$G$"$k$,, E>CV%U%!%$%k$N$h$&$JC18l:w0z$HHf3S$9$k$H%5%$%:$,Bg$-$$. $3$NLdBj$r2r7h$9$k$?$a$K05=L@\Hx.$5$/ $J$i$J$$. K\9F$G$O05=L@\Hx<-G[Ns$rMQ$$$?8!:w%"%k%4%j%:%‘$r, %F%-%9%H<+?H$,ITMW$K$J$k$h$&$KJQ99$9 $k. $ $̂?, %F%-%9%HA4BN$d$=$N0lIt$r05=L@\Hx<-G[Ns$+$iI|85$9$k%"%k%4%j%:%‘$rDs0F$9$k. $3$l$K$h $j, %F%-%9%H$N05=L$H9bB.$J8!:w$NN>N)$,2DG=$H$J$k.
منابع مشابه
Counting Suffix Arrays and Strings
Suffix arrays are used in various application and research areas like data compression or computational biology. In this work, our goal is to characterize the combinatorial properties of suffix arrays and their enumeration. For fixed alphabet size and string length we count the number of strings sharing the same suffix array and the number of such suffix arrays. Our methods have applications to...
متن کاملSuffix arrays: what are they good for?
Recently the theoretical community has displayed a flurry of interest in suffix arrays, and compressed suffix arrays. New, asymptotically optimal algorithms for construction, search, and compression of suffix arrays have been proposed. In this talk we will present our investigations into the practicalities of these latest developments. In particular, we investigate whether suffix arrays can ind...
متن کاملSpace-Economical Algorithms for Finding Maximal Unique Matches
We show space-economical algorithms for finding maximal unique matches (MUM’s) between two strings which are important in large scale genome sequence alignment problems. Our algorithms require only O(n) bits (O(n/ log n) words) where n is the total length of the strings. We propose three algorithms for different inputs: In case the input is only the strings, their compressed suffix array, or th...
متن کاملCompressed and Searchable Indexes for Highly Similar Strings (Invited Talk)
The collection indexing problem is defined as follows: Given a collection of highly similar strings, build a compressed index for the collection of strings, and when a pattern is given, find all occurrences of the pattern in the given strings. Since the index is compressed, we also need a separate operation which retrieves a specified substring of one of the given strings. Such a collection of ...
متن کاملCompact Suffix Trees Resemble PATRICIA Tries: Limiting Distribution of the Depth
Suffix trees are the most frequently used data structures in algorithms on words. In this paper, we consider the depth of a compact suffix tree, also known as the PAT tree, under some simple probabilistic assumptions. For a biased memoryless source, we prove that the limiting distribution for the depth in a PAT tree is the same as the limiting distribution for the depth in a PATRICIA trie, even...
متن کاملBottom-k document retrieval
We consider the problem of retrieving the k documents from a collection of strings where a given pattern P appears least often. This has potential applications in data mining, bioinformatics, security, and big data. We show that adapting the classical linear-space solutions for this problem is trivial, but the compressed-space solutions are not easy to extend. We design a new solution for this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007